Declarative Nodel For Dependency Parsing - A View Into Blackboard Methodology
نویسندگان
چکیده
This paper p resen ts a d e c l a r a t i v e , dependency c o n s t r a i n t model f o r pa rs ing an i n f Lec t i onaL f r e e word o rder Language, t | k e F inn ish . The s t r u c t u r e o f F inn ish sentences is desc r ibed as p a r t i a l dependency t rees o f depth one. Pars ing becomes a n o n d e t e r m i n i s t t c search problem in the f o r e s t o f p a r t i a l parse t r e e s . The search process is ab le to so lve a l so amb igu i t i es and tong -d i s tance dependencies. Pars ing is cont roLLed by a b lackboard system. A ~ork ing parser f o r F inn ish has been implemented based on the modeL.
منابع مشابه
An improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کاملBlackboard-based Dependency Parsing
2 BLACKBOARD MODEL FOR DEPENDENCY PARSING This paper presents • b lackboard-based computat ional modal f o r p a r t i n g an I n f l e c t i o n a l f r ee word order language, l i k e F i n n i s h . The s t r u c t u r e of sentences is descr ibed as p a r t i a l dependency t rees of depth one. Pars ing becomes a n o n d e t e r m l n i s t i c search problem in the f o r e s t o f p a r t ...
متن کاملتأثیر ساختواژهها در تجزیه وابستگی زبان فارسی
Data-driven systems can be adapted to different languages and domains easily. Using this trend in dependency parsing was lead to introduce data-driven approaches. Existence of appreciate corpora that contain sentences and theirs associated dependency trees are the only pre-requirement in data-driven approaches. Despite obtaining high accurate results for dependency parsing task in English langu...
متن کاملDeclarative Syntactic Processing of Natural Language Using Concurrent Constraint Programming and Probabilistic Dependency Modeling
This paper describes a declarative approach to parsing and realization of natural language using a probabilistic dependency model of syntax within a constrained optimization framework. Such an approach is particularly well-suited for applications like machine translation. The paper describes a test-of-concept implementation applied to the classic sentence “Time flies like an arrow.” and discuss...
متن کاملWriting Weighted Constraints for Large Dependency Grammars
Implementing dependency grammar as a set of defeasible declarative rules has fundamental advantages such as expressiveness, automatic disambiguation, and robustness. Although an implementation and a successful large-scale grammar of German are available, so far the construction of constraint dependency grammars has not been described at length. We report on techniques that were used to write th...
متن کامل